1428A - Box is Pull - CodeForces Solution

math *800

Please click on ads to support us..

Python Code: 

t = int(input())
while(t>0):
    x1,y1,x2,y2 = map(int,input().split())
    if x1 == x2:
        time = abs(y1-y2)
    elif y1 == y2:
        time = abs(x1 - x2)
    else:
        time = abs(x1-x2) + abs(y1 - y2) + 2
 
    print(time)
    t = t-1

C++ Code: 

#include<bits/stdc++.h>

using namespace std;

//#define int long long

const int N=200010;

int n,m,T;

signed main()
{
    cin>>T;
    while(T--)
    {
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        if(a==c||b==d)cout<<abs(a-c)+abs(b-d)<<endl;
        else cout<<abs(a-c)+abs(b-d)+2<<endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1279A - New Year Garland
1279B - Verse For Santa
202A - LLPS
978A - Remove Duplicates
1304A - Two Rabbits
225A - Dice Tower
1660D - Maximum Product Strikes Back
1513A - Array and Peaks
1251B - Binary Palindromes
768B - Code For 1
363B - Fence
991B - Getting an A
246A - Buggy Sorting
884A - Book Reading
1180A - Alex and a Rhombus
445A - DZY Loves Chessboard
1372A - Omkar and Completion
159D - Palindrome pairs
981B - Businessmen Problems
1668A - Direction Change
1667B - Optimal Partition
1668B - Social Distance
88B - Keyboard
580B - Kefa and Company
960A - Check the string
1220A - Cards
897A - Scarborough Fair
1433B - Yet Another Bookshelf
1283B - Candies Division
1451B - Non-Substring Subsequence